Solving Quadratic Equations via PhaseLift when There Are About As Many Equations As Unknowns
نویسندگان
چکیده
This note shows that we can recover any complex vector x0 ∈ C exactly from on the order of n quadratic equations of the form |〈ai,x0〉| = bi, i = 1, . . . ,m, by using a semidefinite program known as PhaseLift. This improves upon earlier bounds in [3], which required the number of equations to be at least on the order of n log n. Further, we show that exact recovery holds for all input vectors simultaneously, and also demonstrate optimal recovery results from noisy quadratic measurements; these results are much sharper than previously known results.
منابع مشابه
Haar Matrix Equations for Solving Time-Variant Linear-Quadratic Optimal Control Problems
In this paper, Haar wavelets are performed for solving continuous time-variant linear-quadratic optimal control problems. Firstly, using necessary conditions for optimality, the problem is changed into a two-boundary value problem (TBVP). Next, Haar wavelets are applied for converting the TBVP, as a system of differential equations, in to a system of matrix algebraic equations...
متن کاملModified Wavelet Method for Solving Two-dimensional Coupled System of Evolution Equations
As two-dimensional coupled system of nonlinear partial differential equations does not give enough smooth solutions, when approximated by linear, quadratic and cubic polynomials and gives poor convergence or no convergence. In such cases, approximation by zero degree polynomials like Haar wavelets (continuous functions with finite jumps) are most suitable and reliable. Therefore, modified numer...
متن کاملA Numerical Approach for Solving Quadratic Integral Equations of Urysohn’s Type using Radial Basis Function
Introduction Quadratic integral equations provide an important tool for modeling the numerous problems in engineering and science. These equations appear in the modeling of radiative transfer, kinetic theory of gases, traffic theory, neutron transport and in many other phenomena [2-7]. So, it is clear that solving this class of integral equations can be used to describe many events in the real ...
متن کاملA Method for Solving Convex Quadratic Programming Problems Based on Differential-algebraic equations
In this paper, a new model based on differential-algebraic equations(DAEs) for solving convex quadratic programming(CQP) problems is proposed. It is proved that the new approach is guaranteed to generate optimal solutions for this class of optimization problems. This paper also shows that the conventional interior point methods for solving (CQP) problems can be viewed as a special case of the n...
متن کاملSolving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
We consider the fundamental problem of solving quadratic systems of equations in n variables, where yi = |〈ai,x〉|, i = 1, . . . ,m and x ∈ R is unknown. We propose a novel method, which starting with an initial guess computed by means of a spectral method, proceeds by minimizing a nonconvex functional as in the Wirtinger flow approach [11]. There are several key distinguishing features, most no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Foundations of Computational Mathematics
دوره 14 شماره
صفحات -
تاریخ انتشار 2014